منابع مشابه
Small Littlewood-Richardson coefficients
We develop structural insights into the Littlewood-Richardson graph, whose number of vertices equals the Littlewood-Richardson coefficient cνλ,μ for given partitions λ, μ and ν. This graph was first introduced in [BI12], where its connectedness was proved. Our insights are useful for the design of algorithms for computing the Littlewood-Richardson coefficient: We design an algorithm for the exa...
متن کاملSmall Polynomials with Integer Coefficients
The primary goal of this paper is the study of polynomials with integer coefficients that minimize the sup norm on the set E. In particular, we consider the asymptotic behavior of these polynomials and of their zeros. Let Pn(C) and Pn(Z) be the classes of algebraic polynomials of degree at most n, respectively with complex and with integer coefficients. The problem of minimizing the uniform nor...
متن کاملSolving Polynomials with Small Leading Coefficients
We explore the computation of roots of polynomials via eigenvalue problems. In particular, we look at the case when the leading coeecient is relatively very small. We argue that the companion matrix algorithm (used, for instance, by the Matlab roots function) is inaccurate in this case. The accuracy problem is addressed by using matrix pencils instead. This improvement can be predicted from the...
متن کاملSpatial Evolutionary Games with small selection coefficients
Here we will use results of Cox, Durrett, and Perkins [56] for voter model perturbations to study spatial evolutionary games on Zd, d ≥ 3 when the interaction kernel is finite range, symmetric, and has covariance matrix σ2I. The games we consider have payoff matrices of the form 1 + wG where 1 is matrix of all 1’s and w is small and positive. Since our population size N = ∞, we call our selecti...
متن کاملExtended Clustering Coefficients of Small-World Networks
The clustering coefficient C of a network, which is a measure of direct connectivity between neighbors of the various nodes, ranges from 0 (for no connectivity) to 1 (for full connectivity). We define extended clustering coefficients C(h) of a small-world network based on nodes that are at distance h from a source node, thus generalizing distance-1 neighborhoods employed in computing the ordina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2016
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-015-0658-2